An Exact Algorithm for the Min-Interference Frequency Assignment Problem
نویسندگان
چکیده
In this paper we consider the Frequency Assignment Problem, where the objective is to minimize the cost due to interference arising in a solution. We use a quadratic 0-1 integer programming formulation of the problem as a basis to derive new lower bounds and problem reduction rules. A tree search algorithm, that uses the lower bounds and dominance criteria is also presented. Computational results are shown on standard benchmark instances from the literature.
منابع مشابه
Interference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملAn Enumerative Algorithm for the Frequency Assignment Problem
We present an algorithm to solve the Frequency Assignment Problem for mobile cellular systems and radio and television broadcasting. Frequencies must be assigned to transmitters in order to meet interference requirements and so that the overall signal/noise ratio is satisfactory. The basic scheme is an exact enumerative method, provided with ̄xing criteria to reduce the size of the instances. L...
متن کاملAn Analytical Approach for Single and Mixed-Model Assembly Line Rebalancing and Worker Assignment Problem
In this paper, an analytical approach is used for assembly line rebalancing and worker assignment for single and mixed-model assembly lines based on a heuristic-simulation algorithm. This approach helps to managers to select a better marketing strategy when different combinations of demands are suitable.Furthermore, they can use it as a guideline to know which worker assignment is better for ea...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999